The equivariant Conner-Floyd isomorphism

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Conner-floyd Map for Formal A-modules

A generalization of the Conner-Floyd map from complex cobordism to complex /C-theory is constructed for formal A-modules when A is the ring of algebraic integers in a number field or its p-adic completion. This map is employed to study the Adams-Novikov spectral sequence for formal A-modules and to confirm a conjecture of D. Ravenel. 0. Introduction. Let BP be the spectrum representing Brown-Pe...

متن کامل

Lewis A. Conner: Cornell's Osler.

Lewis A. Conner, MD (1867 to 1950), was a pioneer in public health cardiology, cardiac rehabilitation, and cardiac psychology. He helped establish the Burke Rehabilitation Hospital and was the founding president of the New York and American Heart Associations (AHA). Dr Conner was the founder of the American Heart Journal, America's first medical subspecialty journal, and the official publicatio...

متن کامل

Logic Characterization of Floyd Languages

Floyd languages (FL), alias Operator Precedence Languages, have recently received renewed attention thanks to their closure properties and local parsability which allow one to apply automatic verification techniques (e.g. model checking) and parallel and incremental parsing. They properly include various other classes, noticeably Visual Pushdown languages. In this paper we provide a characteriz...

متن کامل

The Floyd-Warshall Algorithm for Shortest Paths

The Floyd-Warshall algorithm [Flo62, Roy59, War62] is a classic dynamic programming algorithm to compute the length of all shortest paths between any two vertices in a graph (i.e. to solve the all-pairs shortest path problem, or APSP for short). Given a representation of the graph as a matrix of weights M , it computes another matrix M ′ which represents a graph with the same path lengths and c...

متن کامل

Enriched Categories and the Floyd-warshall Connection

We give a correspondence between enriched categories and the Gauss-Kleene-Floyd-Warshall connection familiar to computer scientists. This correspondence shows this generalization of categories to be a close cousin to the generalization of transitive closure algorithms. Via this connection we may bring categorical and 2-categorical constructions into an active but algebraically impoverished aren...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1987

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1987-0911096-0